3011062 GI-Proceedings Cover
نویسندگان
چکیده
The nature of software engineering projects is rather complex. They involve people with different backgrounds, working in different phases and activities. Software engineering is a field where constant technology change takes place, rendering the work of involved people highly dynamic, in the sense that discovering solutions for new problems belongs to the daily tasks. Knowledge in software engineering is diverse and its proportions are immense and continuously expanding. Important needs that drive the use of knowledge management are capturing and sharing process and product knowledge, acquiring knowledge about the application domain and new technologies, as well as knowing who knows what.
منابع مشابه
3012275 GI-Proceedings 133 Cover
This paper presents a printed near field communication system that can be integrated into everyday objects, like paper products or plastic parts. The interface is realised by high-volume production technologies, like printing and injection moulding, as they allow for the integration of “low-end” electronics at low costs and, thus, potentially enable a wide spreading of the technology. As a firs...
متن کاملGreen Infrastructure Design for Stormwater Runoff and Water Quality: Empirical Evidence from Large Watershed-Scale Community Developments
Green infrastructure (GI) design is advocated as a new paradigm for stormwater management, whereas current knowledge of GI design is mostly based on isolated design strategies used at small-scale sites. This study presents empirical findings from two watershed-scale community projects (89.4 km and 55.7 km) in suburban Houston, Texas. The GI development integrates a suite of on-site, infiltratio...
متن کاملBounds for the Clique Cover Width of Factors of the Apex Graph of the Planar Grid
The clique cover width of G, denoted by ccw(G), is the minimum value of the bandwidth of all graphs that are obtained by contracting the cliques in a clique cover of G into a single vertex. For i = 1, 2, ..., d, let Gi be a graph with V (Gi) = V , and let G be a graph with V (G) = V and E(G) = ∩di=1(Gi), then we write G = ∩di=1Gi and call each Gi, i = 1, 2, ..., d a factor of G. The case where ...
متن کاملOn the Parallel Parameterized Complexity of the Graph Isomorphism Problem
In this paper, we study the parallel and the space complexity of the graph isomorphism problem (GI) for several parameterizations. Let H = {H1,H2, · · · ,Hl} be a finite set of graphs where |V (Hi)| ≤ d for all i and for some constant d. Let G be an H-free graph class i.e., none of the graphs G ∈ G contain any H ∈ H as an induced subgraph. We show that GI parameterized by vertex deletion distan...
متن کامل3010441 GI-Proceedings Cover
Computational analysis of pathways in metabolic networks has numerous applications in systems biology. While graph theory-based approaches have been presented that find biotransformation routes from one metabolite to another in these networks, most of these approaches suffer from finding too many routes, most of which are biologically infeasible or meaningless. We present a novel approach for f...
متن کامل